Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
نویسنده
چکیده
We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and “cut-and-permute” moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot algorithm exhibits quasi-ergodic problems. The dynamic properties of the proposed algorithm are studied. The hybrid dynamics is ergodic and exhibits the same optimal critical behavior of the pivot algorithm in the bulk.
منابع مشابه
What can we learn from slow self-avoiding adaptive walks by an infinite radius search algorithm?
Slow self-avoiding adaptive walks by an infinite radius search algorithm (Limax) are analyzed as themselves, and as the network they form. The study is conducted on several NK problems and two HIFF problems. We find that examination of such “slacker” walks and networks can indicate relative search difficulty within a family of problems, help identify potential local optima, and detect presence ...
متن کاملAccurate estimate of the critical exponent nu for self-avoiding walks via a fast implementation of the pivot algorithm.
We introduce a fast implementation of the pivot algorithm for self-avoiding walks, which we use to obtain large samples of walks on the cubic lattice of up to 33x10{6} steps. Consequently the critical exponent nu for three-dimensional self-avoiding walks is determined to great accuracy; the final estimate is nu=0.587 597(7). The method can be adapted to other models of polymers with short-range...
متن کاملEnumeration of compact self-avoiding walks
We have developed a transfer matrix algorithm for the enumeration of compact self-avoiding walks on rectangular strips of the square lattice. The algorithm is easily adapted to other shapes or generalized to problems such as interacting walks. These models are relevant in the study of globular proteins. 2001 Elsevier Science B.V. All rights reserved. PACS: 05.50.+q; 02.70.Rw; 61.25.Hq
متن کاملProtein structure prediction software generate two different sets of conformations. Or the study of unfolded self-avoiding walks
Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioinformatics. Authors of this article have previously shown that, depending on the prediction algorithm, the sets of obtained conformations differ: all the self-avoiding walks...
متن کاملSelf-avoiding walks and polygons on the triangular lattice
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monome...
متن کامل